Mixed Connectivity of Cartesian Graph Products and Bundles

An interconnection network should be fault tolerant, because practical communication networks are exposed to failures of network components. Both failures of nodes and failures of connections between them happen and it is desirable that a network is robust in the sense that a limited number of failures does not break down the whole system. A lot of work has been done on various aspects of network fault tolerance, see for example the survey [6] and more recent papers [9,12,14]. In particular the fault diameter with faulty vertices which was first studied in [10] and the edge fault diameter has been determined for many important networks recently [1–4,7,8,11,13]. Usually either only edge faults or only vertex faults are considered, while the case when both edges and vertices may be faulty is studied rarely. In recent work on fault diameter of Cartesian graph products and bundles [1–4], analogous results were found for both fault diameter and edge fault diameter. However, the proofs for vertex and edge faults are independent, and our effort to see